Vorosweep: a fast generalized crystal growing Voronoi diagram generation algorithm

摘要

We propose a new algorithm for generating quickly approximate generalized Voronoi diagrams of point sites associated to arbitrary convex distance metric in the Euclidian plane. This algorithm produces connected cells by emulating the growth of crystals starting at the point sites, in order to reduce the complexity of the diagram. The main practical contribution is the Vorosweep package which is the reference implementation of the algorithm. Experimental results and benchmarks are given to demonstrate the versatility of this approach.